Ternary Tree and Memory-Efficient Huffman Decoding Algorithm
نویسندگان
چکیده
In this study, the focus was on the use of ternary tree over binary tree. Here, a new one pass Algorithm for Decoding adaptive Huffman ternary tree codes was implemented. To reduce the memory size and fasten the process of searching for a symbol in a Huffman tree, we exploited the property of the encoded symbols and proposed a memory efficient data structure to represent the codeword length of Huffman ternary tree. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method. In this algorithm we tried to find out the staring and ending address of the code to know the length of the code. And then in second algorithm we tried to decode the ternary tree code using binary search method.
منابع مشابه
Hardware Implementation of A Power Efficient Huffman Decoding
Data compression plays an important role in multimedia communication. A major compression technique is performed by converting the fixed-length codes to variable-length codes. Huffman coding is demonstrated to be a very efficient coding scheme and has been widely adopted. However, the variable-length codes increase the difficulties of fast decoding. In addition, the variable decoding time is no...
متن کاملTernary Tree and Clustering Based Huffman Coding Algorithm
In this study, the focus was on the use of ternary tree over binary tree. Here, a new two pass Algorithm for encoding Huffman ternary tree codes was implemented. In this algorithm we tried to find out the codeword length of the symbol. Here I used the concept of Huffman encoding. Huffman encoding was a two pass problem. Here the first pass was to collect the letter frequencies. You need to use ...
متن کاملLevel-compressed Huffman decoding
Based on the breadth-first search manner and the level-compression technique, this letter first presents a new array data structure to represent the classical Huffman tree. Then, the decoding algorithm is given. Both the memory and the decoding time required in the proposed method are less than those of previous methods. Some experimentations are carried out to demonstrate the advantages of the...
متن کاملFaster Implementation of Canonical Minimum Redundancy Prefix Codes
Huffman coding [2] has been widely used in data, image, and video compression. Based on the single-side growing Huffman tree (SHT), Moffat and Turpin [3] recently presented an efficient data structure for representing the SHT. It requires (n + 2d)w bits, where n denotes the number of source symbols; d denotes the depth of the SHT; and w bits are required to save one source symbol or one integer...
متن کاملAn efficient decoding technique for Huffman codes
We present a new data structure for Huffman coding in which in addition to sending symbols in order of their appearance in the Huffman tree one needs to send codes of all circular leaf nodes (nodes with two adjacent external nodes), the number of which is always bounded above by half the number of symbols. We decode the text by using the memory efficient data structure proposed by Chen et al. [...
متن کامل